Data-driven Robust State Estimation Through Off-line Learning and On-line Matching

نویسندگان

چکیده

To overcome the shortcomings of model-driven state estimation methods, this paper proposes a data-driven robust (DDSE) method through off-line learning and on-line matching. At stage, linear regression equation is presented by clustering historical data from supervisory control acquisition (SCADA), which provides guarantee for solving over-learning problem existing DDSE methods; then novel that can be transformed into quadratic programming (QP) models proposed to obtain mapping relationship between measurements variables (MRBMS). The QP well solve collinearity in data. Furthermore, stage greatly accelerated three aspects including reducing categories, constructing tree retrieval structure known topologies, using sensitivity analysis when models. matching quickly current snapshot with ones, corresponding MRBMS obtained, values obtained. Simulations demonstrate has obvious advantages terms suppressing problems, dealing robustness, computation efficiency.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust line matching through line-point invariants

This paper is about line matching by line–point invariants which encode local geometric information between a line and its neighboring points. Specifically, two kinds of line–point invariants are introduced in this paper, one is an affine invariant constructed from one line and two points while the other is a projective invariant constructed from one line and four points. The basic idea of our ...

متن کامل

Learning Curves of On-line and Off-line Training

The performance of on{line training is compared with o { line or batch training using an unrealizable learning task. In naive o { line training this task shows a tendency to strong over tting on the other hand its optimal training scheme is known. In the regime, where overtting occurs, on{line training outperforms batch training quite easily. Asymptotically, o {line training is better but if th...

متن کامل

Image compression with on-line and off-line learning

Images typically contain smooth regions, which are easily compressed by linear transforms, and high activity regions (edges, textures), which are harder to compress. To compress the first kind, we use a “zero” encoder that has infinite context, very low capacity, and which adapts very quickly to the content. For the second, we use an “interpolation” encoder, based on neural networks, which has ...

متن کامل

Off-Line Learning

The core issue of interactive design is to search for a point in a usually large design space. Previous studies have been looking into searching strategies within the interaction. In this report, we consider how previous records of interactions can help future searching. Recall that an interaction can be considered as a sequence of transitions of states. A state is described by the current samp...

متن کامل

Unsupervised learning by examples: On-line versus off-line.

We study both on-line and oo-line learning in the following unsupervised learning scheme: p patterns are sampled independently from a distribution on the N-sphere with a single symmetry breaking orientation. Exact results are obtained in the limit p ! 1 and N ! 1 with nite ratio p=N. One nds that for smooth pattern distributions, the asymptotic behavior of the optimal oo-line and on-line learni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of modern power systems and clean energy

سال: 2021

ISSN: ['2196-5420', '2196-5625']

DOI: https://doi.org/10.35833/mpce.2020.000835